0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.16	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.16/0.37	% Computer   : n014.cluster.edu
0.16/0.37	% Model      : x86_64 x86_64
0.16/0.37	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.37	% Memory     : 8042.1875MB
0.16/0.37	% OS         : Linux 3.10.0-693.el7.x86_64
0.16/0.37	% CPULimit   : 1200
0.16/0.37	% WCLimit    : 120
0.16/0.37	% DateTime   : Tue Jul 13 15:20:19 EDT 2021
0.16/0.37	% CPUTime    : 
0.16/0.37	% Number of cores: 8
0.16/0.37	% Python version: Python 3.6.8
0.16/0.38	# Version: 2.6rc1-ho
0.16/0.39	# No SInE strategy applied
0.16/0.39	# Trying AutoSched0 for 59 seconds
2.67/2.86	# AutoSched0-Mode selected heuristic G_E___107_C18_F1_AE_Q4_CS_SP_CO_S0Y
2.67/2.86	# and selection function SelectMaxLComplexAvoidPosPred.
2.67/2.86	#
2.67/2.86	# Preprocessing time       : 2.439 s
2.67/2.86	
2.67/2.86	# Proof found!
2.67/2.86	# SZS status Theorem
2.67/2.86	# SZS output start CNFRefutation
2.67/2.86	thf(fact_240_inputIneqTrans, axiom, ![X2:name, X29:name, X1:pi, X57:late_subject, X58:name, X4:pi]:(late_transitions @ (input @ X2 @ X29 @ X1) @ (late_BoundR @ X57 @ X58 @ X4)=>~(fresh_717452603ubject @ X2 @ X57)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_240_inputIneqTrans)).
2.67/2.86	thf(fact_149_subject_Oexhaust, axiom, ![X177:late_subject]:(~(![X178:name]:(X177)!=(late_BoundOutputS @ X178))<=![X179:name]:(X177)!=(late_InputS @ X179)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_149_subject_Oexhaust)).
2.67/2.86	thf(fact_237_Late__Semantics_OInput, axiom, ![X2:name, X29:name, X1:pi]:late_transitions @ (input @ X2 @ X29 @ X1) @ (late_BoundR @ (late_InputS @ X2) @ X29 @ X1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_237_Late__Semantics_OInput)).
2.67/2.86	thf(fact_101_freshBoundDerivative_I1_J, axiom, ![X1:pi, X199:late_subject, X29:name, X4:pi, X200:name]:((fresh_name_pi @ X200 @ X1=>fresh_717452603ubject @ X200 @ X199)<=late_transitions @ X1 @ (late_BoundR @ X199 @ X29 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_101_freshBoundDerivative_I1_J)).
2.67/2.86	thf(conj_0, conjecture, (x)!=(aa), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
2.67/2.86	thf(fact_73_Late__Semantics1_Osubject_Oinject_I1_J, axiom, ![X17:name, X348:name]:((late_InputS @ X17)=(late_InputS @ X348)<=>(X17)=(X348)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_73_Late__Semantics1_Osubject_Oinject_I1_J)).
2.67/2.86	thf(fact_8_cClose1_Ohyps_I1_J, axiom, late_transitions @ p @ (late_BoundR @ (late_InputS @ aa) @ y @ p2), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_8_cClose1_Ohyps_I1_J)).
2.67/2.86	thf(fact_42_Late__Semantics_Osubject_Odistinct_I1_J, axiom, ![X223:name, X153:name]:(late_InputS @ X223)!=(late_BoundOutputS @ X153), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_42_Late__Semantics_Osubject_Odistinct_I1_J)).
2.67/2.86	thf(fact_3_assms_I1_J, axiom, fresh_name_pi @ x @ p, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_3_assms_I1_J)).
2.67/2.86	thf(c_0_9, plain, ![X2:name, X29:name, X1:pi, X57:late_subject, X58:name, X4:pi]:(late_transitions @ (input @ X2 @ X29 @ X1) @ (late_BoundR @ X57 @ X58 @ X4)=>~fresh_717452603ubject @ X2 @ X57), inference(fof_simplification,[status(thm)],[fact_240_inputIneqTrans])).
2.67/2.86	thf(c_0_10, plain, ![X177:late_subject]:(![X179:name]:(X177)!=(late_InputS @ X179)=>~(![X178:name]:(X177)!=(late_BoundOutputS @ X178))), inference(fof_simplification,[status(thm)],[fact_149_subject_Oexhaust])).
2.67/2.86	thf(c_0_11, plain, ![X2335:name, X2336:name, X2337:pi, X2338:late_subject, X2339:name, X2340:pi]:(~late_transitions @ (input @ X2335 @ X2336 @ X2337) @ (late_BoundR @ X2338 @ X2339 @ X2340)|~fresh_717452603ubject @ X2335 @ X2338), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
2.67/2.86	thf(c_0_12, plain, ![X3268:name, X3269:name, X3270:pi]:late_transitions @ (input @ X3268 @ X3269 @ X3270) @ (late_BoundR @ (late_InputS @ X3268) @ X3269 @ X3270), inference(variable_rename,[status(thm)],[fact_237_Late__Semantics_OInput])).
2.67/2.86	thf(c_0_13, plain, ![X1:pi, X199:late_subject, X29:name, X4:pi, X200:name]:(late_transitions @ X1 @ (late_BoundR @ X199 @ X29 @ X4)=>(fresh_name_pi @ X200 @ X1=>fresh_717452603ubject @ X200 @ X199)), inference(fof_simplification,[status(thm)],[fact_101_freshBoundDerivative_I1_J])).
2.67/2.86	thf(c_0_14, negated_conjecture, (x)=(aa), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
2.67/2.86	thf(c_0_15, plain, ![X3182:name, X3183:name]:(((late_InputS @ X3182)!=(late_InputS @ X3183)|(X3182)=(X3183))&((X3182)!=(X3183)|(late_InputS @ X3182)=(late_InputS @ X3183))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_73_Late__Semantics1_Osubject_Oinject_I1_J])])).
2.67/2.86	thf(c_0_16, plain, ![X2655:late_subject]:((X2655)=(late_InputS @ (esk133_1 @ X2655))|(X2655)=(late_BoundOutputS @ (esk134_1 @ X2655))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
2.67/2.86	thf(c_0_17, plain, ![X6:name, X1:pi, X3:name, X2:name, X4:pi, X11:late_subject]:(~late_transitions @ (input @ X2 @ X3 @ X1) @ (late_BoundR @ X11 @ X6 @ X4)|~fresh_717452603ubject @ X2 @ X11), inference(split_conjunct,[status(thm)],[c_0_11])).
2.67/2.86	thf(c_0_18, plain, ![X3:name, X2:name, X1:pi]:late_transitions @ (input @ X2 @ X3 @ X1) @ (late_BoundR @ (late_InputS @ X2) @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_12])).
2.67/2.86	thf(c_0_19, plain, ![X2702:pi, X2703:late_subject, X2704:name, X2705:pi, X2706:name]:(~late_transitions @ X2702 @ (late_BoundR @ X2703 @ X2704 @ X2705)|(~fresh_name_pi @ X2706 @ X2702|fresh_717452603ubject @ X2706 @ X2703)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])).
2.67/2.86	thf(c_0_20, plain, late_transitions @ p @ (late_BoundR @ (late_InputS @ aa) @ y @ p2), inference(split_conjunct,[status(thm)],[fact_8_cClose1_Ohyps_I1_J])).
2.67/2.86	thf(c_0_21, negated_conjecture, (x)=(aa), inference(split_conjunct,[status(thm)],[c_0_14])).
2.67/2.86	thf(c_0_22, plain, ![X2:name, X3:name]:((X2)=(X3)|(late_InputS @ X2)!=(late_InputS @ X3)), inference(split_conjunct,[status(thm)],[c_0_15])).
2.67/2.86	thf(c_0_23, plain, ![X11:late_subject]:((X11)=(late_InputS @ (esk133_1 @ X11))|(X11)=(late_BoundOutputS @ (esk134_1 @ X11))), inference(split_conjunct,[status(thm)],[c_0_16])).
2.67/2.86	thf(c_0_24, plain, ![X2905:name, X2906:name]:(late_InputS @ X2905)!=(late_BoundOutputS @ X2906), inference(variable_rename,[status(thm)],[fact_42_Late__Semantics_Osubject_Odistinct_I1_J])).
2.67/2.86	thf(c_0_25, plain, ![X2:name]:~fresh_717452603ubject @ X2 @ (late_InputS @ X2), inference(spm,[status(thm)],[c_0_17, c_0_18])).
2.67/2.86	thf(c_0_26, plain, ![X11:late_subject, X4:pi, X3:name, X2:name, X1:pi]:(fresh_717452603ubject @ X3 @ X11|~late_transitions @ X1 @ (late_BoundR @ X11 @ X2 @ X4)|~fresh_name_pi @ X3 @ X1), inference(split_conjunct,[status(thm)],[c_0_19])).
2.67/2.86	thf(c_0_27, plain, late_transitions @ p @ (late_BoundR @ (late_InputS @ x) @ y @ p2), inference(rw,[status(thm)],[c_0_20, c_0_21])).
2.67/2.86	thf(c_0_28, plain, ![X11:late_subject, X2:name]:((late_BoundOutputS @ (esk134_1 @ X11))=(X11)|(esk133_1 @ X11)=(X2)|(X11)!=(late_InputS @ X2)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
2.67/2.86	thf(c_0_29, plain, ![X2:name, X3:name]:(late_InputS @ X2)!=(late_BoundOutputS @ X3), inference(split_conjunct,[status(thm)],[c_0_24])).
2.67/2.86	thf(c_0_30, plain, ![X11:late_subject]:((late_BoundOutputS @ (esk134_1 @ X11))=(X11)|~fresh_717452603ubject @ (esk133_1 @ X11) @ X11), inference(spm,[status(thm)],[c_0_25, c_0_23])).
2.67/2.86	thf(c_0_31, plain, ![X2:name]:(fresh_717452603ubject @ X2 @ (late_InputS @ x)|~fresh_name_pi @ X2 @ p), inference(spm,[status(thm)],[c_0_26, c_0_27])).
2.67/2.86	thf(c_0_32, plain, ![X2:name]:(esk133_1 @ (late_InputS @ X2))=(X2), inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_28]), c_0_29])).
2.67/2.86	thf(c_0_33, plain, fresh_name_pi @ x @ p, inference(split_conjunct,[status(thm)],[fact_3_assms_I1_J])).
2.67/2.86	thf(c_0_34, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32]), c_0_33])]), c_0_29]), ['proof']).
2.67/2.86	# SZS output end CNFRefutation
2.67/2.86	# Proof object total steps             : 35
2.67/2.86	# Proof object clause steps            : 16
2.67/2.86	# Proof object formula steps           : 19
2.67/2.86	# Proof object conjectures             : 3
2.67/2.86	# Proof object clause conjectures      : 1
2.67/2.86	# Proof object formula conjectures     : 2
2.67/2.86	# Proof object initial clauses used    : 9
2.67/2.86	# Proof object initial formulas used   : 9
2.67/2.86	# Proof object generating inferences   : 6
2.67/2.86	# Proof object simplifying inferences  : 6
2.67/2.86	# Training examples: 0 positive, 0 negative
2.67/2.86	# Parsed axioms                        : 430
2.67/2.86	# Removed by relevancy pruning/SinE    : 0
2.67/2.86	# Initial clauses                      : 28666
2.67/2.86	# Removed in clause preprocessing      : 139
2.67/2.86	# Initial clauses in saturation        : 28527
2.67/2.86	# Processed clauses                    : 745
2.67/2.86	# ...of these trivial                  : 13
2.67/2.86	# ...subsumed                          : 195
2.67/2.86	# ...remaining for further processing  : 537
2.67/2.86	# Other redundant clauses eliminated   : 97
2.67/2.86	# Clauses deleted for lack of memory   : 0
2.67/2.86	# Backward-subsumed                    : 0
2.67/2.86	# Backward-rewritten                   : 23
2.67/2.86	# Generated clauses                    : 1699
2.67/2.86	# ...of the previous two non-trivial   : 1292
2.67/2.86	# Contextual simplify-reflections      : 0
2.67/2.86	# Paramodulations                      : 1267
2.67/2.86	# Factorizations                       : 2
2.67/2.86	# NegExts                              : 19
2.67/2.86	# Equation resolutions                 : 186
2.67/2.86	# Propositional unsat checks           : 0
2.67/2.86	#    Propositional check models        : 0
2.67/2.86	#    Propositional check unsatisfiable : 0
2.67/2.86	#    Propositional clauses             : 0
2.67/2.86	#    Propositional clauses after purity: 0
2.67/2.86	#    Propositional unsat core size     : 0
2.67/2.86	#    Propositional preprocessing time  : 0.000
2.67/2.86	#    Propositional encoding time       : 0.000
2.67/2.86	#    Propositional solver time         : 0.000
2.67/2.86	#    Success case prop preproc time    : 0.000
2.67/2.86	#    Success case prop encoding time   : 0.000
2.67/2.86	#    Success case prop solver time     : 0.000
2.67/2.86	# Current number of processed clauses  : 503
2.67/2.86	#    Positive orientable unit clauses  : 147
2.67/2.86	#    Positive unorientable unit clauses: 1
2.67/2.86	#    Negative unit clauses             : 73
2.67/2.86	#    Non-unit-clauses                  : 282
2.67/2.86	# Current number of unprocessed clauses: 29030
2.67/2.86	# ...number of literals in the above   : 307819
2.67/2.86	# Current number of archived formulas  : 0
2.67/2.86	# Current number of archived clauses   : 23
2.67/2.86	# Clause-clause subsumption calls (NU) : 17116
2.67/2.86	# Rec. Clause-clause subsumption calls : 14296
2.67/2.86	# Non-unit clause-clause subsumptions  : 126
2.67/2.86	# Unit Clause-clause subsumption calls : 3889
2.67/2.86	# Rewrite failures with RHS unbound    : 18
2.67/2.86	# BW rewrite match attempts            : 196
2.67/2.86	# BW rewrite match successes           : 16
2.67/2.86	# Condensation attempts                : 745
2.67/2.86	# Condensation successes               : 2
2.67/2.86	# Termbank termtop insertions          : 2899832
2.67/2.87	
2.67/2.87	# -------------------------------------------------
2.67/2.87	# User time                : 2.429 s
2.67/2.87	# System time              : 0.068 s
2.67/2.87	# Total time               : 2.497 s
2.67/2.87	# Maximum resident set size: 2712 pages
2.67/2.87	EOF